Trie Compression for GPU Accelerated Multi-Pattern Matching
نویسندگان
چکیده
Graphics Processing Units (GPU) allow for running massively parallel applications offloading the Central Processing Unit (CPU) from computationally intensive resources. However GPUs have a limited amount of memory. In this paper, a trie compression algorithm for massively parallel pattern matching is presented demonstrating 85% less space requirements than the original highly efficient parallel failure-less Aho-Corasick, whilst demonstrating over 22 Gbps throughput. The algorithm presented takes advantage of compressed row storage matrices as well as shared and texture memory on the GPU. Keywords–Pattern Matching Algorithm; Trie Compression; Searching; Data Compression; GPU
منابع مشابه
Average Size of a Suffix Tree for Markov Sources
We study a suffix tree built from a sequence generated by a Markovian source. Such sources are more realistic probabilistic models for text generation, data compression, molecular applications, and so forth. We prove that the average size of such a suffix tree is asymptotically equivalent to the average size of a trie built over n independent sequences from the same Markovian source. This equiv...
متن کاملDeploying GPU-based Real-time DXT compression for Networked Visual Sharing
The networked visual sharing application in multi-party collaboration environment needs compression of video streams due to network bandwidth limitation. For interactive real-time sharing, real-time compression of high-quality video as well as audio echo cancellation are required, which commonly depend on the availability of high-cost hard-to-setup specialized compression and echo-cancellation ...
متن کاملGPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs
We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on GPU implementation of the maximum cardinality matching algorithms. We compare the...
متن کاملAn Accelerated Architecture Based on GPU and Multi-Processor Design for Fingerprint Recognition
Fingerprint recognition is widely used in security systems to recognize humans. In both industry and scientific literature, many fingerprint identification systems were developed using different techniques and approaches. Although the number of conducted research works in this field, developed systems suffer for some limitations partially those related the real time computation and fingerprint ...
متن کاملGPU Accelerated Randomized Singular Value Decomposition and Its Application in Image Compression
In this paper, we present a GPU-accelerated implementation of randomized Singular Value Decomposition (SVD) algorithm on a large matrix to rapidly approximate the top-k dominating singular values and correspondent singular vectors. The fundamental idea of randomized SVD is to condense a large matrix into a small dense matrix by random sampling while keeping the important information. Then perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1702.03657 شماره
صفحات -
تاریخ انتشار 2017